Stability Of Unilateral Problem With Nonconvex Constraints∗
نویسنده
چکیده
In this paper, we focuses on stability, asymptotical stability and finite-time stability for a class of differential inclusions governed by a nonconvex superpotential. This problem is known by "evolution hemivariational inequalities". After proposing an existence result of solutions, we give the stability results in terms of smooth Lyapunov functions subjected to some conditions described in terms of the orbital derivatives.
منابع مشابه
Solving nonconvex SDP problems of structural optimization with stability control
The goal of this paper is to formulate and solve structural optimization problems with constraints on the global stability of the structure. The stability constraint is based on the linear buckling phenomenon. We formulate the problem as a nonconvex semidefinite programming problem and introduce an algorithm based on the Augmented Lagrangian method combined with the Trust-Region technique. The ...
متن کاملراهبرد پیشنهاددهی همزمان نیروگاه مجازی در بازار انرژی و خدمات جانبیِ رزرو چرخان و توان راکتیو
This paper addresses the bidding problem faced by a virtual power plant (VPP) in energy, spinning reserve service, and reactive power service market simultaneously. Therefore, a non-equilibrium model based on security constraints price-based unit commitment (SCPBUC), which is take into account the supply-demand balancing and security constraints of VPP, is proposed. By the presented model, VPP ...
متن کاملLinearized Alternating Direction Method of Multipliers for Constrained Nonconvex Regularized Optimization
In this paper, we consider a wide class of constrained nonconvex regularized minimization problems, where the constraints are linearly constraints. It was reported in the literature that nonconvex regularization usually yields a solution with more desirable sparse structural properties beyond convex ones. However, it is not easy to obtain the proximal mapping associated with nonconvex regulariz...
متن کاملAn Efficient Neurodynamic Scheme for Solving a Class of Nonconvex Nonlinear Optimization Problems
By p-power (or partial p-power) transformation, the Lagrangian function in nonconvex optimization problem becomes locally convex. In this paper, we present a neural network based on an NCP function for solving the nonconvex optimization problem. An important feature of this neural network is the one-to-one correspondence between its equilibria and KKT points of the nonconvex optimizatio...
متن کاملSolutions and optimality criteria for nonconvex constrained global optimization problems with connections between canonical and Lagrangian duality
Abstract This paper presents a canonical duality theory for solving a general nonconvex 1 quadratic minimization problem with nonconvex constraints. By using the canonical dual 2 transformation developed by the first author, the nonconvex primal problem can be con3 verted into a canonical dual problem with zero duality gap. A general analytical solution 4 form is obtained. Both global and local...
متن کامل